package com.lihepeng.leecode.tree;

/**
 * 完美二叉树节点类
 */

public class BeautifyTreeNode {
    int val;
    BeautifyTreeNode left;
    BeautifyTreeNode right;
    BeautifyTreeNode next;

    public BeautifyTreeNode(int val) {
        this.val = val;
    }

    public BeautifyTreeNode(int val, BeautifyTreeNode left, BeautifyTreeNode right, BeautifyTreeNode next) {
        this.val = val;
        this.left = left;
        this.right = right;
        this.next = next;
    }


}
